leetcode-patterns/Design/208_Implement_Trie_(Prefix Tree).java at solutions · sarvex/leetcode-patterns · GitHub

Name: leetcode-patterns/Design/208_Implement_Trie_(Prefix Tree).java at solutions · sarvex/leetcode-patterns · GitHub
Rating: 4.6 (9500 reviews)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
classTrie {
classTrieNode {
privateTrieNode[] children;
privatebooleanisWord;

publicTrieNode() {
children = newTrieNode[26];
isWord = false;
 }
 }

privateTrieNoderoot;

publicTrie() {
root = newTrieNode();
 }

publicvoidinsert(Stringword) {
TrieNoderunner = root;

for (charc : word.toCharArray()) {
if (runner.children[c - 'a'] == null) {
runner.children[c - 'a'] = newTrieNode();
 }

runner = runner.children[c - 'a'];
 }

runner.isWord = true;
 }

publicbooleansearch(Stringword) {
TrieNoderunner = root;

for (charc : word.toCharArray()) {
if (runner.children[c - 'a'] == null) {
returnfalse;
 }
runner = runner.children[c - 'a'];
 }

returnrunner.isWord;
 }

publicbooleanstartsWith(Stringprefix) {
TrieNoderunner = root;

for (charc : prefix.toCharArray()) {
if (runner.children[c - 'a'] == null) {
returnfalse;
 }
runner = runner.children[c - 'a'];
 }

returntrue;
 }
}